Deductive Verification of Reactive Systems
ثبت نشده
چکیده
Fall 2007: Assignment No. 3 Due Date: 12.21.07 December 10, 2007 The solution to this assignment should be submitted as attachment to an e-mail message. The textual part should be prepared as a postscript, PDF, or Word document. All submitted smv and pf files should be submitted as separate files. You may group all relevant files into a single file, using ZIP or TAR. 1 Peterson(N) Algorithm In Fig. 1 we present Algorithm Peterson(N), which implements mutual exclusion among N processes, using shared variables but no semaphores. in N : integer where N > 1 local y : array [1..N ] of 0..N where ∀k : y[k] = 0 s : array [1..N ] of 1..N N i=1 P [i] ::
منابع مشابه
An Update on STeP: Deductive-Algorithmic Verification of Reactive Systems
The Stanford Temporal Prover, STeP, is a tool for the computer-aided formal verification of reactive systems, including real-time and hybrid systems, based on their temporal specification. STeP integrates methods for deductive and algorithmic verification, including model checking, theorem proving, automatic invariant generation, abstraction and modular reasoning. We describe the most recent ve...
متن کاملPredicate diagrams as basis for the verification of reactive systems
This thesis proposes a diagram-based formalism for verifying temporal properties of reactive systems. Diagrams integrate deductive and algorithmic verification techniques for the verification of finite and infinite-state systems, thus combining the expressive power and flexibility of deduction with the automation provided by algorithmic methods. Our formal framework for the specification and ve...
متن کاملAbstraction and Modular Verification of Infinite-State Reactive Systems
ion and Modular Verification of Infinite-State Reactive Systems ⋆ Zohar Manna, Michael A. Colón, Bernd Finkbeiner, Henny B. Sipma and Tomás E. Uribe Computer Science Department Stanford University Stanford, CA. 94305-9045 [email protected] Abstract. We review a number of temporal verification techniques for reactive systems using modularity and abstraction. Their use allows the verification...
متن کاملSTeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems
The Stanford Temporal Prover, STeP, combines deductive methods with algorithmic techniques to verify linear-time temporal logic speciications of reactive and real-time systems. STeP uses veriication rules, veriication diagrams, automatically generated invariants, model checking, and a collection of decision procedures to verify nite-and innnite-state systems. computer-aided formal veriication o...
متن کاملDeductive Verification
Clocked transition systems is a computational model for modelling real-time systems. Using this model we are able to use deductive verification for proving properties over our systems.
متن کاملSTeP: The Stanford Temporal Prover
We describe the Stanford Temporal Prover (STeP), a system being developed to support the computer-aided formal verification of concurrent and reactive systems based on temporal specifications. Unlike systems based on model-checking, STeP is not restricted to finite-state systems. It combines model checking and deductive methods to allow the verification of a broad class of systems, including pr...
متن کامل